منابع مشابه
Properties of Multihead Two-way Probabilistic Nite Automata
We present properties of multihead two-way probabilistic nite automata that parallel those of their deterministic and nondeterministic counterparts. We deene multihead proba-bilistic nite automata with log-space constructible transition probabilities, and we describe a simple technique to simulate these automata by standard log-space probabilistic Turing machines. Next, we represent log-space p...
متن کاملPath-Bounded One-Way Multihead Finite Automata
For each positive integer r ≥ 1, a nondeterministic machine M is r path-bounded if for any input word x, there are r computation paths of M on x. This paper investigates the accepting powers of pathbounded one-way (simple) multihead nondeterministic finite automata. It is shown that for each k ≥ 2 and r ≥ 1, there is a language accepted by an (r+1) path-bounded one-way nondeterministic k head f...
متن کاملOn Stateless Multihead Finite Automata and Multihead Pushdown Automata
A stateless k-head two-way deterministic finite automaton (k-head 2DFA), has only one state, hence the designation stateless. Its transitions depends solely on the symbols currently scanned by its k heads, and in every such transition each head can move one cell left, right, or remain stationary. An input, which is delimited by end markers, is accepted if the machine, when started with all head...
متن کاملRemarks on Sorting and One-Way Multihead Finite Automata
Multihead one-way finite automata (l-MFA) received much attention in studies of devices of low complexity. This is because they work in linear time and because of their simplicity. On the other hand, the class of languages recognized by l-MFA is rather small. Anyway, it contains many languages important from the practical point of view. Despite the simplicity of l-MFA, many problems concerning ...
متن کاملNondeterminism is essential for reversal-bounded two-way multihead finite automata
It is proved for some "nice" function / that/(fl)-reversal-bounded two-way nondeterministic finite automata are more powerful than /(n)-reversal-bounded two-way deterministic ones. This solves a simplified extension of the well-known DLOG ? NLOG problem.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 1973
ISSN: 0022-0000
DOI: 10.1016/s0022-0000(73)80048-0